Normative Systems Represented by Boolean Quasi-orderings
نویسندگان
چکیده
By a normative system jurists often mean the law of a country, like Swedish law, or part of the law of a country, such as the Swedish law of contracts. With regard to the issue how a logical reconstruction of a normative system should be made, a central question is what kind of entities a normative system is composed of and how it should be represented. The aim of the present paper is to contribute to the study of this field. More specifically, our contribution aims at presenting a framework for analysing different kinds of joinings of conceptual structures in a normative system. A case in view is where one of these structures is descriptive and the other normative. In a previous paper, we presented a working model where conceptual structures were represented by lattices.1 This was the first step in developing the theory, having the limitation that the role of negation for concept formation was not dealt with. This limitation is eliminated in the present paper, which is different in several respects. The framework to be developed is based on the theory of Boolean algebra instead of lattice theory. The basic kind of relations dealt with are quasi-orderings rather than partial orderings, as was the case in our previous paper, where partial orderings were introduced by a transition to equivalence classes. The framework of what we will call ‘‘Boolean quasi-orderings’’ is general in the sense that the main results are not tied to a specific interpretation in terms of conditions as was the case in the earlier paper. Thus, the case where the domains of the orderings have conditions as their members, so-called condition implication structures, only plays the part of one of several models of the theory. Also, the new framework is more flexible in the sense that it is not confined to the joining of two subsystems within a background system. In the new framework it is possible to generate a background system when subsystems are given. The paper is intended as an overview of some central ideas and results pertaining to the theory as it is now developed. For this reason we do not
منابع مشابه
The Role of Connections as Minimal Norms in Normative Systems
The paper aims at developing an algebraic representation of normative systems by sets of minimal norms, “connections”, within relational structures called condition implication structures. It is shown that, given some general presuppositions, a normative system is completely determined by its set of connections, and that comparisons between normative systems can be made by considering whether c...
متن کاملPreservation of Stochastic Orderings of Interdependent Series and Parallel Systems by Componentwise Switching to Exponentiated Models
This paper discusses the preservation of some stochastic orders between two interdependent series and parallel systems when the survival and distribution functions of all components switch to the exponentiated model. For the series systems, the likelihood ratio, hazard rate, usual, aging faster, aging intensity, convex transform, star, superadditive and dispersive orderings, and for the paralle...
متن کاملPoset algebras over well quasi-ordered posets
A new class of partial order-types, class G bqo is defined and investigated here. A poset P is in the class G bqo iff the poset algebra F (P ) is generated by a better quasi-order G that is included in L(P ). The free Boolean algebra F (P ) and its free distrivutive lattice L(P ) were defined in [ABKR]. The free Boolean algebra F (P ) contains the partial order P and is generated by it: F (P ) ...
متن کاملBetter Quasi-Ordered Transition Systems
Many existing algorithms for model checking of infinite-state systems operate on constraints which are used to represent (potentially infinite) sets of states. A general powerful technique which can be employed for proving termination of these algorithms is that of well quasi-orderings. Several methodologies have been proposed for derivation of new well quasi-ordered constraint systems. However...
متن کاملOptimal ordered binary decision diagrams for read-once formulas
In many applications like verification or combinatorial optimization, OBDDs (ordered binary decision diagrams) are used as a representation or data structure for Boolean functions. Efficient algorithms exist for the important operations on OBDDs, and many functions can be represented in reasonable size if a good variable ordering is chosen. In general, it is NP-hard to compute optimal or near-o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001